|
In numerical analysis, inverse quadratic interpolation is a root-finding algorithm, meaning that it is an algorithm for solving equations of the form ''f''(''x'') = 0. The idea is to use quadratic interpolation to approximate the inverse of ''f''. This algorithm is rarely used on its own, but it is important because it forms part of the popular Brent's method. ==The method== The inverse quadratic interpolation algorithm is defined by the recurrence relation : ::::: where ''f''''k'' = ''f''(''x''''k''). As can be seen from the recurrence relation, this method requires three initial values, ''x''0, ''x''1 and ''x''2. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「inverse quadratic interpolation」の詳細全文を読む スポンサード リンク
|